How To Obtain Powerful Parsers

ثبت نشده
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

How To Obtain Powerful Parsers That Are Elegant and Practical

Most of the functional parsers published today focus on elegance. But they pay for this elegance by neglecting practical requirements such as efficiency and decent error handling. By contrast, a traditional parser (generator) based on LLor LR-principles focuses on efficiency and neglects issues such as elegance and understandability almost entirely. In this paper we combine these pragmatic issu...

متن کامل

Dynamic Programming Algorithms for Transition-Based Dependency Parsers

We develop a general dynamic programming technique for the tabulation of transition-based dependency parsers, and apply it to obtain novel, polynomial-time algorithms for parsing with the arc-standard and arc-eager models. We also show how to reverse our technique to obtain new transition-based dependency parsers from existing tabular methods. Additionally, we provide a detailed discussion of t...

متن کامل

Optimizing Planar and 2-Planar Parsers with MaltOptimizer

MaltOptimizer is a tool that is capable of finding an optimal configuration for MaltParser models, taking into account that nowadays dependency parsers require careful tuning in order to obtain state-of-the-art results, and this tuning is normally based on specialized knowledge. The Planar and 2-Planar parsers are two different parsing algorithms included in MaltParser. In the present paper, we...

متن کامل

Técnicas Deductivas para el Análisis Sintáctico con Corrección de Errores

We introduce error-correcting parsing schemata, which allow us to define error-correcting parsers in a high-level, declarative way. This formalism can be used to describe error-correcting parsers in a simple and uniform manner, and provides a formal basis allowing to prove their correctness and other properties. We also show how these schemata can be used to obtain different implementations of ...

متن کامل

Semi-supervised dependency parsing using generalized tri-training

Martins et al. (2008) presented what to the best of our knowledge still ranks as the best overall result on the CONLLX Shared Task datasets. The paper shows how triads of stacked dependency parsers described in Martins et al. (2008) can label unlabeled data for each other in a way similar to co-training and produce end parsers that are significantly better than any of the stacked input parsers....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004